Generalized Tur\'an problems for small graphs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Turan Related Problems for Hypergraphs

For an /-uniform hypergraph 3and an integer n, the Turan number ex(n, F) for F on n vertices is denned to be the maximum size \Q\ of a hypergraph Q C [n] not containing a copy of F C2\ as a subhypergraph. For 1 = 1 and f = Kk , the complete graph on k vertices, these numbers were determined by P. Turan. However, for I > 2, and nearly any hypergraph F, the Turan problem of determining the number...

متن کامل

Open problems for equienergetic graphs

The energy of a graph is equal to the sum of the absolute values of its eigenvalues. Two graphs of the same order are said to be equienergetic if their energies are equal. We point out the following two open problems for equienergetic graphs. (1) Although it is known that there are numerous pairs of equienergetic, non-cospectral trees, it is not known how to systematically construct any such pa...

متن کامل

Solving Generalized Small Inverse Problems

We introduce a “generalized small inverse problem (GSIP)” and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x0, x1, . . . , xn) = x0h(x1, . . . , xn) + C = 0(mod M) for an n-variate polynomial h, non-zero integers C and M . Our algorithm is based on lattice-based Coppersmith technique. We provide a strategy for construction of a lattice basis ...

متن کامل

1231-1235 Turan LAJP 3348:Turan

Ismayil YILMAZ 1, Ismail DEMIRYILMAZ 2, Mehmet I. TURAN 3*, Bahadır SULEYMAN 4, Isil S. TURAN 5, Durdu ALTUNER 4, Hamit H. ALP 6 & Halis SULEYMAN 4 1 Erzincan University, Faculty of Medicine, Department of Surgery, Erzincan, Turkey 2 Ibni Sina Hospital, Department of General Surgery, Kayseri, Turkey 3 Diyarbakir Research and Educational Hospital, Department of Pediatric Neurology, Diyarbakir, T...

متن کامل

open problems for equienergetic graphs

the energy of a graph is equal to the sum of the absolute values of its eigenvalues. two graphs of the same order are said to be equienergetic if their energies are equal. we point out the following two open problems for equienergetic graphs. (1) although it is known that there are numerous pairs of equienergetic, non-cospectral trees, it is not known how to systematically construct any such pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discussiones Mathematicae Graph Theory

سال: 2021

ISSN: 1234-3099,2083-5892

DOI: 10.7151/dmgt.2388